Sub-Constant Error Low Degree Test of Almost-Linear Size
نویسندگان
چکیده
منابع مشابه
A Sub-constant Error-probability Pcp Characterization of Np Part Ii: the Consistency Test
This paper introduces a new consistency-test for a class of codes, referred to as geometric-codes, and proves the test to be of small error-probability. This consistency-test enables us to conclude a strong characterization of NP in terms of PCP. Speciically, our theorem states that, for any given > 0, membership in any NP language can be veriied with O(1) accesses, each reading logarithmic num...
متن کاملRevocable IBE Systems with Almost Constant-Size Key Update
Identity-based encryption (IBE) has been regarded as an attractive alternative to more conventional certificate-based public key systems. It has recently attracted not only considerable research from the academic community, but also interest from the industry and standardization bodies. However, while key revocation is a fundamental requirement to any public key systems, not much work has been ...
متن کاملSub-linear Decoding of Huffman Codes Almost In-place
We present a succinct data structure storing the Hu man encoding that permits sub linear decoding in the number of transmitted bits The size of the extra storage except for the storage of the symbols in the alphabet for the new data structure is O l logN bits where l is the longest Hu man code and N is the number of symbols in the alphabet We present a solution that typically decodes texts of s...
متن کاملLinear-Size Constant-Depth Polylog-Treshold Circuits
We present a simple explicit construction giving unbounded fan-in circuits with $o(n)$ gates and depth $O(r)$ for the threshold function of $n$ variables when the threshold is at most $(log n)^r$, for any integer $r>0$. This improves a result of Atjai and Ben-Or, who showed the existence of circuits of size $n^{O(1)}$. This is the highest threshold for which polynomial-size, constant-depth circ...
متن کاملPseudorandom Functions in Almost Constant Depth from Low-Noise LPN
Pseudorandom functions (PRFs) play a central role in symmetric cryptography. While in principle they can be built from any one-way functions by going through the generic HILL (SICOMP 1999) and GGM (JACM 1986) transforms, some of these steps are inherently sequential and far from practical. Naor, Reingold (FOCS 1997) and Rosen (SICOMP 2002) gave parallelizable constructions of PRFs in NC and TC ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2008
ISSN: 0097-5397,1095-7111
DOI: 10.1137/060656838